The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Types:
f :: g:h → g:h
g :: g:h → g:h
h :: g:h → g:h
f' :: s → s → s → f'
s :: s → s
hole_g:h1_0 :: g:h
hole_f'2_0 :: f'
hole_s3_0 :: s
gen_g:h4_0 :: Nat → g:h
gen_s5_0 :: Nat → s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
f, f'

(6) Obligation:

TRS:
Rules:
f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Types:
f :: g:h → g:h
g :: g:h → g:h
h :: g:h → g:h
f' :: s → s → s → f'
s :: s → s
hole_g:h1_0 :: g:h
hole_f'2_0 :: f'
hole_s3_0 :: s
gen_g:h4_0 :: Nat → g:h
gen_s5_0 :: Nat → s

Generator Equations:
gen_g:h4_0(0) ⇔ hole_g:h1_0
gen_g:h4_0(+(x, 1)) ⇔ g(gen_g:h4_0(x))
gen_s5_0(0) ⇔ hole_s3_0
gen_s5_0(+(x, 1)) ⇔ s(gen_s5_0(x))

The following defined symbols remain to be analysed:
f, f'

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

Induction Base:
f(gen_g:h4_0(+(1, 0)))

Induction Step:
f(gen_g:h4_0(+(1, +(n7_0, 1)))) →_R^Ω(1)
g(f(f(gen_g:h4_0(+(1, n7_0))))) →_IH
g(f(*6_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Types:
f :: g:h → g:h
g :: g:h → g:h
h :: g:h → g:h
f' :: s → s → s → f'
s :: s → s
hole_g:h1_0 :: g:h
hole_f'2_0 :: f'
hole_s3_0 :: s
gen_g:h4_0 :: Nat → g:h
gen_s5_0 :: Nat → s

Lemmas:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

Generator Equations:
gen_g:h4_0(0) ⇔ hole_g:h1_0
gen_g:h4_0(+(x, 1)) ⇔ g(gen_g:h4_0(x))
gen_s5_0(0) ⇔ hole_s3_0
gen_s5_0(+(x, 1)) ⇔ s(gen_s5_0(x))

The following defined symbols remain to be analysed:
f'

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol f'.

(11) Obligation:

TRS:
Rules:
f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Types:
f :: g:h → g:h
g :: g:h → g:h
h :: g:h → g:h
f' :: s → s → s → f'
s :: s → s
hole_g:h1_0 :: g:h
hole_f'2_0 :: f'
hole_s3_0 :: s
gen_g:h4_0 :: Nat → g:h
gen_s5_0 :: Nat → s

Lemmas:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

Generator Equations:
gen_g:h4_0(0) ⇔ hole_g:h1_0
gen_g:h4_0(+(x, 1)) ⇔ g(gen_g:h4_0(x))
gen_s5_0(0) ⇔ hole_s3_0
gen_s5_0(+(x, 1)) ⇔ s(gen_s5_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

TRS:
Rules:
f(g(x)) → g(f(f(x)))
f(h(x)) → h(g(x))
f'(s(x), y, y) → f'(y, x, s(x))

Types:
f :: g:h → g:h
g :: g:h → g:h
h :: g:h → g:h
f' :: s → s → s → f'
s :: s → s
hole_g:h1_0 :: g:h
hole_f'2_0 :: f'
hole_s3_0 :: s
gen_g:h4_0 :: Nat → g:h
gen_s5_0 :: Nat → s

Lemmas:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

Generator Equations:
gen_g:h4_0(0) ⇔ hole_g:h1_0
gen_g:h4_0(+(x, 1)) ⇔ g(gen_g:h4_0(x))
gen_s5_0(0) ⇔ hole_s3_0
gen_s5_0(+(x, 1)) ⇔ s(gen_s5_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
f(gen_g:h4_0(+(1, n7_0))) → *6_0, rt ∈ Ω(n7₀)

(16) BOUNDS(n^1, INF)